The Complexity of Automated Reasoning
نویسنده
چکیده
This thesis explores the relative complexity of proofs produced by the automatic theorem proving procedures of analytic tableaux, linear resolution, the connection method, tree resolution and the Davis-Putnam procedure. It is shown that tree resolution simulates the improved tableau procedure and that SL-resolution and the connection method are equivalent to restrictions of the improved tableau method. The theorem by Tseitin that the Davis-Putnam Procedure cannot be simulated by tree resolution is given an explicit and simplified proof. The hard examples for tree resolution are contradictions constructed from simple Tseitin graphs. iii Acknowledgements
منابع مشابه
Different Task Complexity Factors and Cognitive Individual Differences: The Effects on EFL Writers’ Performance
This study aimed at examining the main and interaction effects of increased intentional reasoning demands, planning time, and also language learning aptitude on syntactic complexity, accuracy, lexical complexity, and fluency (CALF) of 226 EFL learners’ performance on letter writing tasks. The participants were first randomly assigned to three experimental groups to be given a task with differin...
متن کاملTask Complexity Manipulation and Accuracy in Writing Performance
This study aimed to investigate the impact of task sequencing, along +/- reasoning demands dimension, on writing task performance in terms of accuracy. The study was motivated by Robinson’s Cognition Hypothesis (CH) as well as previous studies investigating the relationships between task complexity and second language production. The participants of the study were 90 intermediate students at t...
متن کامل3D Scene and Object Classification Based on Information Complexity of Depth Data
In this paper the problem of 3D scene and object classification from depth data is addressed. In contrast to high-dimensional feature-based representation, the depth data is described in a low dimensional space. In order to remedy the curse of dimensionality problem, the depth data is described by a sparse model over a learned dictionary. Exploiting the algorithmic information theory, a new def...
متن کاملOptimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کاملOn Practical Reasoning and Automated Planning
Practical reasoning and automated planning are strictly related as they strive to answer to the same question: “which is the best course of action for an agent?” While the first research field addressed this topic mainly from an epistemological point of view, automated planning dealt with this question for the most partfrom a heuristic or reasoning perspective. In this position paper we want to...
متن کاملThe effect of increase in task cognitive complexity on Iranian EFL learners’ accuracy and linguistic complexity: A test of Robinson’s Cognition Hypothesis
Designing a task with a reasonable level of cognitive complexity has always been important for syllabus designers, teachers, as well as researchers. This is because task manipulation may lead to different results in oral production. The present study was an attempt to explore the effect of this manipulation - based on Robinson’s resource-directing model (reasoning demands, number of el...
متن کامل